A coarse-grained parallelization of genetic algorithms
نویسندگان
چکیده
منابع مشابه
Coarse-Grained Parallelization of Cellular-Automata Simulation Algorithms
Simulating spatial dynamics in physics by Cellular Automata (CA) requires very large computation power, and, hence, CA simulation algorithms are to be implemented on multiprocessors. The preconceived opinion, that no much effort is required to obtain highly efficient coarse grained parallel CA algorithm, is not always true. In fact, a great variety of CA modifications coming into practical use ...
متن کاملAsynchronous Genetic Algorithms for Heterogeneous Networks Using Coarse-Grained Dataflow
Genetic algorithms (GAs) are an attractive class of techniques for solving a variety of complex search and optimization problems. Their implementation on a distributed platform can provide the necessary computing power to address large-scale problems of practical importance. On heterogeneous networks, however, the performance of a global parallel GA can be limited by synchronization points duri...
متن کاملCoarse grained parallel algorithms for graph matching
Parallel graph algorithm design is a very well studied topic. Many results have been presented for the PRAM model. However, these algorithms are inherently fine grained and experiments show that PRAM algorithms do often not achieve the expected speedup on real machines because of large message overheads. In this paper, we present coarse grained parallel graph algorithms with small message overh...
متن کاملScalable Coarse Grained Parallel Interval Graph Algorithms
We present scalable coarse grained parallel algorithms for solving interval graph problems on a BSP-like model{Coarse Grained Multicomputers (CGM). The problems we consider include: nding maximum independent set, maximum weighted clique, minimum coloring and cut vertices and bridges. With scalability at n p p ; 8 > 0 (here n denotes the total input size and p the number of processors), our algo...
متن کاملCoarse - Grained Parallel Algorithms forMulti - Dimensional Wavelet
This paper presents parallel algorithms for computing multi-dimensional wavelet transforms on both shared memory and distributed memory machines. Traditional data partitioning methods for n-dimensional Discrete Wavelet Transforms (DWTs) call for data redistribution once a one dimensional wavelet transform is computed along each dimension. To avoid the data communication inherent in this redistr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advances in Intelligent Informatics
سال: 2018
ISSN: 2548-3161,2442-6571
DOI: 10.26555/ijain.v4i1.137